Bursty Traac and Nite Capacity Queues

Traac on high-speed networks is expected to bèbursty'. This has spurred interest in the queueing properties of bursty traac models, such as Markov additive processes. These processes have by now been studied extensively by many authors, but almost exclusively in the innnite buuer setting. This paper deals with the case of a nite-buuered queue loaded with bursty traac. It shows how to calculate the exact solution for the queue length distribution and overrow rate in equilibrium, and also how to nd eecient upper and lower bounds for these quantities. In addition, the large buuer asymptotic behaviour of the queue length distribution and overrow rate are studied for a queue loaded with general traac, using large deviation techniques.